Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method
نویسنده
چکیده
Continuation methods are a well-known technique for computing several stationary solutions of problems involving one or more physical parameters. In order to determine whether a stationary solution is stable, and to detect the bifurcation points of the problem, one has to compute the rightmost eigenvalues of a related, generalized eigenvalue problem. The recently developed Jacobi-Davidson QZ method can be very eeective for computing several eigenvalues of a given generalized eigenvalue problem. In this paper we will explain how the Jacobi-Davidson QZ method can be used to compute the eigenvalues needed in the application of continuation methods. As an illustration, the two-dimensional Rayleigh-B enard problem has been studied, with the Rayleigh number as a physical parameter. We investigated the stability of stationary solutions, and several bifurcation points have been detected. The Jacobi-Davidson QZ method turns out to be very eecient for this problem.
منابع مشابه
Jacobi - Davidson style QR and QZ algorithmsfor the partial reduction of matrix pencilsbyDiederik
The Jacobi-Davidson subspace iteration method ooers possibilities for solving a variety of eigen-problems. In practice one has to apply restarts because of memory limitations, in order to restrict computational overhead, and also if one wants to compute several eigenvalues. In general, restarting has negative eeects on the convergence of subspace methods. We will show how eeective restarts can ...
متن کاملUnclassified Report: Jacobi-Davidson methods and preconditioning with applications in pole-zero analysis
This report discusses the application of Jacobi-Davidson style methods in electric circuit simulation. Using the generalised eigenvalue problem, which arises from pole-zero analysis, as a starting point, both the JDQR-method and the JDQZ-method are studied. Although the JDQR-method (for the ordinary eigenproblem) and the JDQZ-method (for the generalised eigenproblem) are designed to converge fa...
متن کاملArnoldi and Jacobi-Davidson methods for generalized eigenvalue problems Ax=λBx with singular B
In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem Ax = λBx are needed. If exact linear solves with A−σB are available, implicitly restarted Arnoldi with purification is a common approach for problems where B is positive semidefinite. In this paper, a new approach based on implicitly restarted Arnoldi will be presented that avoids most of th...
متن کاملArnoldi and Jacobi - Davidson methods for generalized eigenvalue problems
In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem Ax = λBx are needed. If exact linear solves with A − σB are available, implicitly restarted Arnoldi with purification is a common approach for problems where B is positive semidefinite. In this paper, a new approach based on implicitly restarted Arnoldi will be presented that avoids most of ...
متن کاملJacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
Recently the Jacobi–Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem and JDQR for the standard eigenproblem,...
متن کامل